Optimal Schedules for 2-guard Room Search
نویسندگان
چکیده
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the guards must move along the boundary of the room and eventually meet again. We give polynomial time algorithms for finding a search schedule that minimizes the total distance travelled by the guards and for minimizing the time required for the search by solving L1 shortest path problems among curved obstacles in a polygon.
منابع مشابه
Algorithms for Optimizing Search Schedules in a Polygon
In the area of motion planning, considerable work has been done on guarding problems, where “guards”, modelled as points, must guard a polygonal space from “intruders”. Different variants of this problem involve varying a number of factors. The guards performing the search may vary in terms of their number, their mobility, and their range of vision. The model of intruders may or may not allow t...
متن کاملA unified and efficient solution to the room search problem
We study the problem of searching for a mobile intruder in a polygonal region P with a door d (called a room) by a mobile searcher. The objective is to decide whether there exists a search schedule for the searcher to detect the intruder without allowing him to exit P through d, no matter how fast he moves, and if so, generate a search schedule. A searcher is called the k-searcher if he holds k...
متن کاملOperating Room Scheduling in Teaching Hospitals: A Novel Stochastic Optimization Model
Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملMonotonicity in Graph Searching
We give a new proof of the result, due to A. LaPaugh, that a graph may be optimally " searched " without clearing any edge twice. o 19~~ Academic PWS, IIIC. Let us regard a graph as a system of tunnels containing a (lucky, invisible, fast) fugitive. We desire to capture this fugitive by " searching " all edges of the graph, in a sequence of discrete steps, while using the fewest possible " guar...
متن کامل